The Decomposition Tree for analyses of Boolean functions
نویسندگان
چکیده
MAIK FRIEDEL†, SWETLANA NIKOLAJEWA‡ and THOMAS WILHELM§ †Biocomputing Group, Fritz Lipmann Institute (FLI), Beutenbergstr. 11, D-07745 Jena, Germany Email: [email protected] ‡Department of Bioinformatics, Friedrich Schiller University Jena, Ernst-Abbe-Platz 2, D-07743 Jena, Germany §Theoretical Systems Biology, Institute of Food Research, Norwich Research Park, Norwich NR4 7UH, United Kingdom Email: [email protected]
منابع مشابه
Bi-Decomposition and Tree-Height Reduction for Timing Optimization
A novel approach for timing-driven logic decomposition is presented. It is based on the combination of two strategies: logic bi-decomposition of Boolean functions and treeheight reduction of Boolean expressions. This technologyindependent approach allows to find tree-like expressions with smaller depths than the ones obtained by state-of-theart techniques. Experimental results show an average d...
متن کاملAlgorithms for Boolean Function Query Properties
We present new algorithms to compute fundamental properties of a Boolean function given in truth-table form. Specifically, we give an O(N logN) algorithm for block sensitivity, an O(N logN) algorithm for ‘tree decomposition,’ and an O(N) algorithm for ‘quasisymmetry.’ These algorithms are based on new insights into the structure of Boolean functions that may be of independent interest. We also ...
متن کاملEfficient decomposition of comparison and its applications
The paper deals with transformation algorithms for decomposing Boolean neural networks (NNs); this being done with a view to possible VLSI implementation of NNs using threshold gates (TGs). We detail a possible tree decomposition for COMPARISON, and show how this can be used for the decomposition of Boolean functions (BFs) belonging to FN,m – the class of BFs of N variables that have exactly m ...
متن کاملON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES
Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...
متن کاملTiming-driven logic bi-decomposition
An approach for logic decomposition that produces circuits with reduced logic depth is presented. It combines two strategies: logic bi-decomposition of Boolean functions and tree-height reduction of Boolean expressions. It is a technology-independent approach that enables one to find tree-like expressions with smaller depths than the ones obtained by state-of-the-art techniques. The approach ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematical Structures in Computer Science
دوره 18 شماره
صفحات -
تاریخ انتشار 2008